Mixed Iterated Revisions: Rationale, Algorithms and Complexity
نویسندگان
چکیده
Several forms of iterable belief change exist, differing in the kind and its strength: some operators introduce formulae, others remove them; add formulae unconditionally, only as additions to previous beliefs; relative current situation, all possible cases. A sequence changes may involve several them: for example, first step is a revision, second contraction third refinement beliefs. The ten considered this article are shown be reducible three: lexicographic severe withdrawal. In turn, these three can expressed terms revision at cost restructuring sequence. This needs not done explicitly: an algorithm that works on original shown. complexity mixed sequences also analyzed. Most them require polynomial number calls satisfiability checker, even easier.
منابع مشابه
The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions
We consider the computational complexity of evaluating nested counterfactuals over a propositional knowledge base. Counterfactual implication models a statement "if p, then q," where p is known or expected to be false, and is different from material implication A nested counterfactual is a counterfactual statement where the conclusion q is a (possibly negated) counterfactual. Statements of the ...
متن کاملFinding Least Expensive Tolerance Solutions and Least Expensive Tolerance Revisions: Algorithms and Computational Complexity
For an engineering design, tolerances in design parameters are selected so that within these tolerances, we guarantee the desired functionality. Feasible algorithms are known for solving the corresponding computational problems: the problem of finding tolerances that guarantee the given functionality, and the problem of checking whether given tolerances guarantee this functionality. In this pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2023
ISSN: ['1557-945X', '1529-3785']
DOI: https://doi.org/10.1145/3583071